Pickup and delivery problem in the collaborative city courier service by using genetic algorithm and nearest distance

One problem in collaborative pickup delivery (PDP) was excessive outsourced jobs. It happened many studies on the PDP. Besides, revenue sharing it unclear although important. This work aimed to propose a novel PDP model which minimizes total travel distance while maintains low proposed several contributions. First, prioritized internal jobs first rather than full model. Second, new adopted cluster-first route-second and mixed delivery. developed by combining genetic algorithm nearest where used clustering process routing process. The simulation result shows that better comparing models: (1) combined K-means (KMGA) (2) simulated annealing last-in first-out (SNLIFO) When number of orders high (300 units), 37 percent lower KMGA 30 SNLIFO In average, outsourcing rate 70 previous models.